Applying multi-phase particle swarm optimization to solve bulk cargo port scheduling problem
نویسندگان
چکیده
منابع مشابه
Applying Aspects of Multi-robot Search to Particle Swarm Optimization
We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to multi-robot search scenarios. The neighborhood structure of PSO is modified to accurately represent feasible neighborhoods in multiple robot systems with limited communication in several different ways. The new algorithms are test...
متن کاملSolve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm
The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. Compared with the genetic algorithm...
متن کاملMulti-phase Discrete Particle Swarm Optimization
This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.
متن کاملApplying Particle Swarm Optimization to Adaptive Controller
A design for a model-free learning adaptive control (MFLAC) based on pseudo-gradient concepts and optimization procedure by particle swarm optimization (PSO) is presented in this paper. PSO is a method for optimizing hard numerical functions on metaphor of social behavior of flocks of birds and schools of fish. A swarm consists of individuals, called particles, which change their positions over...
متن کاملApplying Particle Swarm Optimization for the Absolute p-center Problem
Locating facilities on anywhere on a network is known as the absolute p-center location problem and it is proven to be NP-hard problem. Most of the recent approaches solve largescale vertex p-center location problem in which facilities can be located only on the nodes of the network. However, rarely algorithms are developed to solve large-scale absolute p-center problem. Particle swarm optimiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Production Engineering & Management
سال: 2016
ISSN: 1854-6250,1855-6531
DOI: 10.14743/apem2016.4.228